Spreading load for highly popular content with asynchronous counted writes

ABSTRACT

A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method begins by receiving a store data object request from the user device. The method continues by initiating storage of N instances of the received data object in the storage set. The method continues by issuing a status response to the user device when detecting that M instances have been successfully stored and sending an instance i of the data to the user device when receiving a read instance i of the data object request from the user device.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present U.S. Utility patent application claims priority pursuant to 35 U.S.C. § 120 as a continuation-in-part of U.S. Utility application Ser. No. 15/075,946, entitled “RE-ENCODING DATA IN A DISPERSED STORAGE NETWORK,” filed Mar. 21, 2016, which claims priority pursuant to 35 U.S.C. § 119(e) to U.S. Provisional Application No. 62/168,114, entitled “RE-ENCODING DATA IN A DISPERSED STORAGE NETWORK,” filed May 29, 2015, both of which are hereby incorporated herein by reference in their entirety and made part of the present U.S. Utility patent application for all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not applicable.

BACKGROUND OF THE INVENTION

Technical Field of the Invention

This invention relates generally to computer networks and more particularly to dispersing error encoded data.

Description of Related Art

Computing devices are known to communicate data, process data, and/or store data. Such computing devices range from wireless smart phones, laptops, tablets, personal computers (PC), work stations, and video game devices, to data centers that support millions of web searches, stock trades, or on-line purchases every day. In general, a computing device includes a central processing unit (CPU), a memory system, user input/output interfaces, peripheral device interfaces, and an interconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using “cloud computing” to perform one or more computing functions (e.g., a service, an application, an algorithm, an arithmetic logic function, etc.) on behalf of the computer. Further, for large services, applications, and/or functions, cloud computing may be performed by multiple cloud computing resources in a distributed manner to improve the response time for completion of the service, application, and/or function. For example, Hadoop is an open source software framework that supports distributed applications enabling application execution by thousands of computers.

In addition to cloud computing, a computer may use “cloud storage” as part of its memory system. As is known, cloud storage enables a user, via its computer, to store files, applications, etc. on an Internet storage system. The Internet storage system may include a RAID (redundant array of independent disks) system and/or a dispersed storage system that uses an error correction scheme to encode data for storage.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a dispersed or distributed storage network (DSN) in accordance with the present invention;

FIG. 2 is a schematic block diagram of an embodiment of a computing core in accordance with the present invention;

FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data in accordance with the present invention;

FIG. 4 is a schematic block diagram of a generic example of an error encoding function in accordance with the present invention;

FIG. 5 is a schematic block diagram of a specific example of an error encoding function in accordance with the present invention;

FIG. 6 is a schematic block diagram of an example of a slice name of an encoded data slice (EDS) in accordance with the present invention;

FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of data in accordance with the present invention;

FIG. 8 is a schematic block diagram of a generic example of an error decoding function in accordance with the present invention;

FIG. 9 is a schematic block diagram of another embodiment of a distributed computing system in accordance with the present invention; and

FIG. 9A is a flowchart illustrating an example of accessing redundantly stored data in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a dispersed, or distributed, storage network (DSN) 10 that includes a plurality of computing devices 12-16, a managing unit 18, an integrity processing unit 20, and a DSN memory 22. The components of the DSN 10 are coupled to a network 24, which may include one or more wireless and/or wire lined communication systems; one or more non-public intranet systems and/or public internet systems; and/or one or more local area networks (LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of storage units 36 that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.), at a common site, or a combination thereof. For example, if the DSN memory 22 includes eight storage units 36, each storage unit is located at a different site. As another example, if the DSN memory 22 includes eight storage units 36, all eight storage units are located at the same site. As yet another example, if the DSN memory 22 includes eight storage units 36, a first pair of storage units are at a first common site, a second pair of storage units are at a second common site, a third pair of storage units are at a third common site, and a fourth pair of storage units are at a fourth common site. Note that a DSN memory 22 may include more or less than eight storage units 36. Further note that each storage unit 36 includes a computing core (as shown in FIG. 2, or components thereof) and a plurality of memory devices for storing dispersed error encoded data.

Each of the computing devices 12-16, the managing unit 18, and the integrity processing unit 20 include a computing core 26, which includes network interfaces 30-33. Computing devices 12-16 may each be a portable computing device and/or a fixed computing device. A portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core. A fixed computing device may be a computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment. Note that each of the managing unit 18 and the integrity processing unit 20 may be separate computing devices, may be a common computing device, and/or may be integrated into one or more of the computing devices 12-16 and/or into one or more of the storage units 36.

Each interface 30, 32, and 33 includes software and hardware to support one or more communication links via the network 24 indirectly and/or directly. For example, interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via the network 24, etc.) between computing devices 14 and 16. As another example, interface 32 supports communication links (e.g., a wired connection, a wireless connection, a LAN connection, and/or any other type of connection to/from the network 24) between computing devices 12 & 16 and the DSN memory 22. As yet another example, interface 33 supports a communication link for each of the managing unit 18 and the integrity processing unit 20 to the network 24.

Computing devices 12 and 16 include a dispersed storage (DS) client module 34, which enables the computing device to dispersed storage error encode and decode data as subsequently described with reference to one or more of FIGS. 3-8. In this example embodiment, computing device 16 functions as a dispersed storage processing agent for computing device 14. In this role, computing device 16 dispersed storage error encodes and decodes data on behalf of computing device 14. With the use of dispersed storage error encoding and decoding, the DSN 10 is tolerant of a significant number of storage unit failures (the number of failures is based on parameters of the dispersed storage error encoding function) without loss of data and without the need for a redundant or backup copies of the data. Further, the DSN 10 stores data for an indefinite period of time without data loss and in a secure manner (e.g., the system is very resistant to unauthorized attempts at accessing the data).

In operation, the managing unit 18 performs DS management services. For example, the managing unit 18 establishes distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for computing devices 12-14 individually or as part of a group of user devices. As a specific example, the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSTN memory 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault. The managing unit 18 facilitates storage of DS error encoding parameters for each vault by updating registry information of the DSN 10, where the registry information may be stored in the DSN memory 22, a computing device 12-16, the managing unit 18, and/or the integrity processing unit 20.

The DSN managing unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of the DSN memory 22. The user profile information includes authentication information, permissions, and/or the security parameters. The security parameters may include encryption/decryption scheme, one or more encryption keys, key generation scheme, and/or data encoding/decoding scheme.

The DSN managing unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the DSTN managing unit 18 tracks the number of times a user accesses a non-public vault and/or public vaults, which can be used to generate per-access billing information. In another instance, the DSTN managing unit 18 tracks the amount of data stored and/or retrieved by a user device and/or a user group, which can be used to generate per-data-amount billing information.

As another example, the managing unit 18 performs network operations, network administration, and/or network maintenance. Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34) to/from the DSN 10, and/or establishing authentication credentials for the storage units 36. Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of the DSN 10. Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of the DSN 10.

The integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices. At a high level, the integrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from the DSN memory 22. For retrieved encoded slices, they are checked for errors due to data corruption, outdated version, etc. If a slice includes an error, it is flagged as a ‘bad’ slice. For encoded data slices that were not received and/or not listed, they are flagged as missing slices. Bad and/or missing slices are subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices to produce rebuilt slices. The rebuilt slices are stored in the DSTN memory 22.

FIG. 2 is a schematic block diagram of an embodiment of a computing core 26 that includes a processing module 50, a memory controller 52, main memory 54, a video graphics processing unit 55, an input/output (IO) controller 56, a peripheral component interconnect (PCI) interface 58, an IO interface module 60, at least one IO device interface module 62, a read only memory (ROM) basic input output system (BIOS) 64, and one or more memory interface modules. The one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66, a host bus adapter (HBA) interface module 68, a network interface module 70, a flash interface module 72, a hard drive interface module 74, and a DSN interface module 76.

The DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). The DSN interface module 76 and/or the network interface module 70 may function as one or more of the interface 30-33 of FIG. 1. Note that the IO device interface module 62 and/or the memory interface modules 66-76 may be collectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data. When a computing device 12 or 16 has data to store it disperse storage error encodes the data in accordance with a dispersed storage error encoding process based on dispersed storage error encoding parameters. The dispersed storage error encoding parameters include an encoding function (e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.), a data segmenting protocol (e.g., data segment size, fixed, variable, etc.), and per data segment encoding values. The per data segment encoding values include a total, or pillar width, number (T) of encoded data slices per encoding of a data segment i.e., in a set of encoded data slices); a decode threshold number (D) of encoded data slices of a set of encoded data slices that are needed to recover the data segment; a read threshold number (R) of encoded data slices to indicate a number of encoded data slices per set to be read from storage for decoding of the data segment; and/or a write threshold number (W) to indicate a number of encoded data slices per set that must be accurately stored before the encoded data segment is deemed to have been properly stored. The dispersed storage error encoding parameters may further include slicing information (e.g., the number of encoded data slices that will be created for each data segment) and/or slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).

In the present example, Cauchy Reed-Solomon has been selected as the encoding function (a generic example is shown in FIG. 4 and a specific example is shown in FIG. 5); the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5, a decode threshold of 3, a read threshold of 4, and a write threshold of 4. In accordance with the data segmenting protocol, the computing device 12 or 16 divides the data (e.g., a file (e.g., text, video, audio, etc.), a data object, or other data arrangement) into a plurality of fixed sized data segments (e.g., 1 through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more). The number of data segments created is dependent of the size of the data and the data segmenting protocol.

The computing device 12 or 16 then disperse storage error encodes a data segment using the selected encoding function (e.g., Cauchy Reed-Solomon) to produce a set of encoded data slices. FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM). The size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values. To produce the data matrix (DM), the data segment is divided into a plurality of data blocks and the data blocks are arranged into D number of rows with Z data blocks per row. Note that Z is a function of the number of data blocks created from the data segment and the decode threshold number (D). The coded matrix is produced by matrix multiplying the data matrix by the encoding matrix.

FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three. In this example, a first data segment is divided into twelve data blocks (D1-D12). The coded matrix includes five rows of coded data blocks, where the first row of X11-X14 corresponds to a first encoded data slice (EDS 1_1), the second row of X21-X24 corresponds to a second encoded data slice (EDS 2_1), the third row of X31-X34 corresponds to a third encoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to a fourth encoded data slice (EDS 4_1), and the fifth row of X51-X54 corresponds to a fifth encoded data slice (EDS 5_1). Note that the second number of the EDS designation corresponds to the data segment number.

Returning to the discussion of FIG. 3, the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices. A typical format for a slice name 60 is shown in FIG. 6. As shown, the slice name (SN) 60 includes a pillar number of the encoded data slice (e.g., one of 1-T), a data segment number (e.g., one of 1-Y), a vault identifier (ID), a data object identifier (ID), and may further include revision level information of the encoded data slices. The slice name functions as, at least part of, a DSN address for the encoded data slice for storage and retrieval from the DSN memory 22.

As a result of encoding, the computing device 12 or 16 produces a plurality of sets of encoded data slices, which are provided with their respective slice names to the storage units for storage. As shown, the first set of encoded data slices includes EDS 1_1 through EDS 5_1 and the first set of slice names includes SN 1_1 through SN 5_1 and the last set of encoded data slices includes EDS 1_Y through EDS 5_Y and the last set of slice names includes SN 1_Y through SN 5_Y.

FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of a data object that was dispersed storage error encoded and stored in the example of FIG. 4. In this example, the computing device 12 or 16 retrieves from the storage units at least the decode threshold number of encoded data slices per data segment. As a specific example, the computing device retrieves a read threshold number of encoded data slices.

To recover a data segment from a decode threshold number of encoded data slices, the computing device uses a decoding function as shown in FIG. 8. As shown, the decoding function is essentially an inverse of the encoding function of FIG. 4. The coded matrix includes a decode threshold number of rows (e.g., three in this example) and the decoding matrix in an inversion of the encoding matrix that includes the corresponding rows of the coded matrix. For example, if the coded matrix includes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2, and 4, and then inverted to produce the decoding matrix.

Some content is of a highly popular form, meaning many users of a DSN may be storing or accessing it at the same time. Even when the content being stored is the same, it may not necessarily be possible to store a single copy to be shared by all users, for a number of possible reasons: it may be encrypted so only certain users can understand it, the performance capacity of a width number of DS units may be insufficient to handle the content's access frequency, or other reasons. It may even be that the rate of ingest bursts to such high levels, that the DS units cannot absorb the content at the rate that it comes in. In these cases, the concept of asynchronous counted writes (ACW) is useful.

With ACW, a DS processing unit may be instructed to store N instances of a given piece of content, but N may be so large that the time required to complete the storage operation may be greater than the amount of time the requester is able or willing to wait.

In one embodiment, under the ACW model, the DS processing unit will return a response after some fraction X % of the number of requested instances have been written. The response indicates to the requester receipt of the message, and that its processing of the storage operation has begun. Note that X % may in some cases be configured to be 0%. Or alternatively, the value of X may be included as part of the request. The DS processing unit also returns a request identifier (ID), enabling the requester to later query the progress of the storage operation.

The DS processing unit then continues to write the multiple instances in the background asynchronously until the total requested number N instances have been written successfully. At a future time, the requester may send a Progress Status Request to the DS processing unit, containing a request ID returned in the original request. The DS processing unit then responds with a number M<=N indicating the total number of instances that have been stored thus far, or if the request ID is no longer known (perhaps because it is incorrect or because the operation completed long ago) will return a response indicating that the request ID is unknown. At any time, the requester may issue a read request, indicating the object and an index value i, so long as i is less than or equal to M. If the supplied i is greater than M, then the DS processing unit will return an error response. If it is less than or equal to M, then the DS processing unit will return the instance of the content associated uniquely with the i-th instance of the content. This enables later association of unique instances at the time of read and before all the writes have been completed.

FIG. 9 is a schematic block diagram of another embodiment of dispersed storage network (DSN) that includes the user device 14 (computing device) of FIG. 1, the distributed storage and task (DST) processing unit 16 (computing device) of FIG. 1, the network 24 of FIG. 1, and a storage set (storage units 36). The DST processing unit 16 includes the DST processing 34 (DS client module) of FIG. 1 and a replication module 902. The storage set 904 includes a set of DST execution (EX) units 1-n. Each DST execution unit includes a processing module 84 and a memory 88. Each DST execution unit may be implemented utilizing the DST execution unit 36 (storage unit) of FIG. 1. Hereafter, each DST execution unit may be interchangeably referred to as a storage unit and the storage set may be interchangeably referred to as a set of storage units. The DSN functions to access redundantly stored data.

In an example of operation of the accessing of the redundantly stored data, the DST processing unit 16 receives a store data object request from the user device 14. The store data object request includes one or more of a data object (e.g., data object A) for storage and an instance count N (e.g., 3). Having received the store data object request, the DST processing unit 16 initiates storage of N instances of the received data object in the storage set. For example, the DST processing 34 dispersed storage error encodes the data object A to produce sets of encoded data slices and generates one or more unique sets of slice names for each instance. Replication module 902 replicates the sets of encoded data slices to produce N replicated sets of encoded data slices. The DST processing unit 16 sequentially stores each replicated set of encoded data slices from instance 1 through N. For the example, the DST processing unit issues, via the network 24, a set of write requests 1-n to the storage set, where the set of write requests 1-n facilitates sending encoded data slices A1-1-1, A1-1-2, through A1-1-S to DST execution unit 1, encoded data slices A1-2-1, A1-2-2, through A1-2-S to DST execution unit 2, etc., for the first instance of the sets of encoded data slices etc. (e.g., for the other instances).

The DST execution units issue, via the network 24, write responses 1-n to the DST processing unit 16 in response to the write requests 1-n indicating status (e.g., successfully stored, not stored yet, storage failure) of storage of sets of encoded data slices of the one or more instances. For example, at a time t1, the DST execution units 1-n issue write responses 1-n indicating that only the first instance of the sets of encoded data slices have been successfully stored so far.

The DST processing unit 16 issues a status response to the user device 14 when detecting that M of the N instances have been successfully stored (e.g., at a given time frame). For example, at time t1, the DST processing unit 16 interprets received write responses to identify a successfully stored instance, generates a status response A, and issues a status response A to the user device 14 indicating that M=1 instance has been successfully stored. Alternatively, or in addition to, the DST processing unit 16 issues the status response to the user device 14 in response to a status request received from the user device 14.

The DST processing 16 issues an instance i of the data object to the user device 14 when receiving a read instance i data object request from the user device 14 and the instance i has been successfully written to the storage set. For example, the DST processing unit 16 receives a read instance i of data object A request from the user device 14, determines whether the instance i has been successfully written (e.g., query a status table, interpret received list slice responses, interprets received read slice responses), and when successfully written, recovers the instance i (e.g., retrieves at least a decode threshold number of encoded data slices for each of the sets of encoded data slices associated with the instance, and for each set, dispersed storage error decodes the retrieved at least a decode threshold number of encoded data slices to reproduce a data segment of the data object A), and sends the i-th reproduced instance of data object A to the user device 14.

FIG. 9A is a flowchart illustrating an example of accessing redundantly stored data. In particular, a method is presented for use in conjunction with one or more functions and features described in conjunction with FIGS. 1-2, 3-8, and also FIGS. 9 and 9A.

The method begins or continues at a step 906 where a processing module (e.g., of a distributed storage and task (DST) processing unit) receives a store data object request, where the request includes a data object for storage and an instance count. The store data object request includes one or more of a data object for storage, and instance count N, an identifier of a requesting entity, and a name of the data object.

The method continues at step 908 where the processing module initiates storage of an instance count number of instances of the received data object in a set of storage units. For example, the processing module dispersed storage error encodes the data object to produce sets of encoded data slices, for each instance, generates one or more unique sets of slice names, replicates sets of encoded data slices to produce N replicated sets of encoded data slices, and sequentially stores each replicated set of encoded data slices from instance 1 to instance N.

The method continues at step 910 where the processing module issues a status response to a requesting entity when detecting that an instance threshold number of instances of the instance count number of instances of the received data object have been successfully stored in the set of storage units. For example, the processing module interprets received write responses to identify a successfully stored instance, generates and sends the status response to the requesting entity when the number of successfully stored instances is substantially the same as the instance threshold number. Alternatively, or in addition to, the processing module issues the status response receiving a status request from the requesting entity.

The method continues at step 912 where the processing module sends a selected instance of the instance count number of instances of the received data object to the requesting entity when the selected instance is available. For example, the processing module receives a read instance request, determines whether the instance has been successfully stored, when successfully stored, recovers the instance, and sends the selected instance to the requesting entity.

The method described above in conjunction with the processing module can alternatively be performed by other modules of the dispersed storage network or by other computing devices. In addition, at least one memory section (e.g., a non-transitory computer readable storage medium) that stores operational instructions can, when executed by one or more processing modules of one or more computing devices of the dispersed storage network (DSN), cause the one or more computing devices to perform any or all of the method steps described above.

It is noted that terminologies as may be used herein such as bit stream, stream, signal sequence, etc. (or their equivalents) have been used interchangeably to describe digital information whose content corresponds to any of a number of desired types (e.g., data, video, speech, audio, etc. any of which may generally be referred to as ‘data’).

As may be used herein, the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude differences. As may also be used herein, the term(s) “configured to”, “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for an example of indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As may further be used herein, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two items in the same manner as “coupled to”. As may even further be used herein, the term “configured to”, “operable to”, “coupled to”, or “operably coupled to” indicates that an item includes one or more of power connections, input(s), output(s), etc., to perform, when activated, one or more its corresponding functions and may further include inferred coupling to one or more other items. As may still further be used herein, the term “associated with”, includes direct and/or indirect coupling of separate items and/or one item being embedded within another item.

As may be used herein, the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal 1 has a greater magnitude than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1. As may be used herein, the term “compares unfavorably”, indicates that a comparison between two or more items, signals, etc., fails to provide the desired relationship.

As may also be used herein, the terms “processing module”, “processing circuit”, “processor”, and/or “processing unit” may be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions. The processing module, module, processing circuit, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, and/or processing unit. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. Note that if the processing module, module, processing circuit, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network). Further note that if the processing module, module, processing circuit, and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry. Still further note that, the memory element may store, and the processing module, module, processing circuit, and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures. Such a memory device or memory element can be included in an article of manufacture.

One or more embodiments have been described above with the aid of method steps illustrating the performance of specified functions and relationships thereof. The boundaries and sequence of these functional building blocks and method steps have been arbitrarily defined herein for convenience of description. Alternate boundaries and sequences can be defined so long as the specified functions and relationships are appropriately performed. Any such alternate boundaries or sequences are thus within the scope and spirit of the claims. Further, the boundaries of these functional building blocks have been arbitrarily defined for convenience of description. Alternate boundaries could be defined as long as the certain significant functions are appropriately performed. Similarly, flow diagram blocks may also have been arbitrarily defined herein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence could have been defined otherwise and still perform the certain significant functionality. Such alternate definitions of both functional building blocks and flow diagram blocks and sequences are thus within the scope and spirit of the claims. One of average skill in the art will also recognize that the functional building blocks, and other illustrative blocks, modules and components herein, can be implemented as illustrated or by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof.

In addition, a flow diagram may include a “start” and/or “continue” indication. The “start” and “continue” indications reflect that the steps presented can optionally be incorporated in or otherwise used in conjunction with other routines. In this context, “start” indicates the beginning of the first step presented and may be preceded by other activities not specifically shown. Further, the “continue” indication reflects that the steps presented may be performed multiple times and/or may be succeeded by other activities not specifically shown. Further, while a flow diagram indicates a particular ordering of steps, other orderings are likewise possible provided that the principles of causality are maintained.

The one or more embodiments are used herein to illustrate one or more aspects, one or more features, one or more concepts, and/or one or more examples. A physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein. Further, from figure to figure, the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.

Unless specifically stated to the contra, signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential. For instance, if a signal path is shown as a single-ended path, it also represents a differential signal path. Similarly, if a signal path is shown as a differential path, it also represents a single-ended signal path. While one or more particular architectures are described herein, other architectures can likewise be implemented that use one or more data buses not expressly shown, direct connectivity between elements, and/or indirect coupling between other elements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of the embodiments. A module implements one or more functions via a device such as a processor or other processing device or other hardware that may include or operate in association with a memory that stores operational instructions. A module may operate independently and/or in conjunction with software and/or firmware. As also used herein, a module may contain one or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes one or more memory elements. A memory element may be a separate memory device, multiple memory devices, or a set of memory locations within a memory device. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. The memory device may be in a form a solid state memory, a hard drive memory, cloud memory, thumb drive, server memory, computing device memory, and/or other physical medium for storing digital information.

While particular combinations of various functions and features of the one or more embodiments have been expressly described herein, other combinations of these features and functions are likewise possible. The present disclosure is not limited by the particular examples disclosed herein and expressly incorporates these other combinations. 

What is claimed is:
 1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises: receiving a store data object request including a data object for storage and an instance count N from a requesting entity; initiating storage of N instances of the data object in a storage set; issuing a status response to the requesting entity when detecting that M instances have been successfully stored; and sending a selected instance i of the instance count N of instances of the data object to the requesting entity when the selected instance i is available.
 2. The method of claim 1, wherein the initiating storage of N instances includes: dispersed storage error encoding the data object to produce sets of encoded data slices, and for each instance, generating one or more unique sets of slice names, replicating sets of encoded data slices to produce N replicated sets of encoded data slices, and sequentially storing each of the replicated sets of encoded data slices from instance 1 to instance N.
 3. The method of claim 1, wherein the issuing a status response includes: interpreting received write responses to identify a successfully stored instance, generating and sending the status response when a number of successfully stored instances is at least the same as an instance threshold number.
 4. The method of claim 1 further comprises issuing the status response when receiving a status request from the requesting entity.
 5. The method of claim 4 wherein the status response includes a number M<=N indicating a total number of instances that have been stored thus far.
 6. The method of claim 4 further comprises, if a request ID of the requesting entity is no longer known, returning a response indicating that the request ID is unknown.
 7. The method of claim 6 wherein the request ID is unknown because it is any of: incorrect or the storage completed.
 8. The method of claim 1, wherein the sending an instance i of the data object to the requesting entity includes: receiving a read instance request, determining whether the instance i has been successfully written, and when successfully written, recovering the instance i and sending the selected instance i to the requesting entity.
 9. The method of claim 8, wherein the recovering includes: retrieving at least a decode threshold number of encoded data slices for each of a plurality of sets of encoded data slices associated with the instance i, and for each set, dispersed storage error decoding the retrieved at least a decode threshold number of encoded data slices to reproduce a data segment.
 10. A computing device of a group of computing devices of a dispersed storage network (DSN), the computing device comprises: an interface; a local memory; and a processing module operably coupled to the interface and the local memory, wherein the processing module functions to: receive a store data object request including a data object for storage and an instance count N from a requesting entity; initiate storage of N instances of the data object in a storage set; issue a status response to the requesting entity when detecting that M instances have been successfully stored; and send a selected instance i of the instance count N of instances of the data object to the requesting entity when the selected instance i is available.
 11. The computing device of claim 10, wherein the initiating storage of N instances includes: dispersed storage error encoding the data object to produce sets of encoded data slices, and for each instance, generating one or more unique sets of slice names, replicating sets of encoded data slices to produce N replicated sets of encoded data slices, and sequentially storing each of the replicated sets of encoded data slices from instance 1 to instance N.
 12. The computing device of claim 10, wherein the issuing a status response includes: interpreting received write responses to identify a successfully stored instance, generating and sending the status response when a number of successfully stored instances is at least the same as an instance threshold number.
 13. The computing device of claim 10 further comprises the processing module functioning to issue the status response when receiving a status request from the requesting entity.
 14. The computing device of claim 13 wherein the status response includes a number M<=N indicating a total number of instances that have been stored thus far.
 15. The computing device of claim 13 further comprises, if a request ID of the requesting entity is no longer known, returning a response indicating that the request ID is unknown.
 16. The computing device of claim 15 wherein the request ID is unknown because it is any of: incorrect or the storage completed.
 17. The computing device of claim 10, wherein the sending an instance i of the data object to the requesting entity includes: receiving a read instance request, determining whether the instance i has been successfully written, and when successfully written, recovering the instance i and sending the selected instance i to the requesting entity.
 18. The computing device of claim 17, wherein the recovering includes: retrieving at least a decode threshold number of encoded data slices for each of a plurality of sets of encoded data slices associated with the instance i, and for each set, dispersed storage error decoding the retrieved at least a decode threshold number of encoded data slices to reproduce a data segment. 